459 research outputs found

    Energy-Optimum Throughput and Carrier Sensing Rate in CSMA-Based Wireless Networks

    Get PDF
    Cataloged from PDF version of article.We propose a model for the energy consumption of a node as a function of its throughput in a wireless CSMA network. We first model a single-hop network, and then a multi-hop network. We show that operating the CSMA network at a high throughput is energy inefficient since unsuccessful carrier sensing attempts increase the energy consumption per transmitted bit. Operating the network at a low throughput also causes energy inefficiency because of increased sleeping duration. Achieving a balance between these two opposite operating regimes, we derive the energy-optimum carrier-sensing rate and the energy-optimum throughput which maximize the number of transmitted bits for a given energy budget. For the single-hop case, we show that the energy-optimum total throughput increases as the number of nodes sharing the channel increases. For the multi-hop case, we show that energy-optimum throughput decreases as the degree of the conflict graph corresponding to the network increases. For both cases, the energy-optimum throughput reduces as the power required for carrier-sensing increases. The energy-optimum throughput is also shown to be substantially lower than the maximum throughput and the gap increases as the degree of the conflict graph increases for multi-hop networks. © 2002-2012 IEEE

    Spatio-Temporal Analysis of Throughput for Single-Hop CSMA Networks

    Get PDF
    Cataloged from PDF version of article.Throughput model for non-persistent CSMA networks which was proposed by Kleinrock and Tobagi has been widely used, although it provides a loose lower bound when nodes are distributed in a large area because the analysis assumes that the propagation delay between each pair of users equals to the largest propagation delay in the network. We present a throughput analysis which considers the spatial distribution of nodes. We obtain a simple throughput expression which predicts throughput with an 8% maximum error whereas the earlier model results in a 44% error when the maximum propagation delay equals to the packet transmission time

    Throughput modeling of single hop CSMA networks with non-negligible propagation delay

    Get PDF
    Cataloged from PDF version of article.We analyze the performance of the CSMA protocol under propagation delays that are comparable with packet transmission times. We propose a semi-Markov model for the 2-node CSMA channel. For the 2-node case, the capacity reduces to 40% of the zero-delay capacity when the one-way propagation delay is 10% of the packet transmission time. We then extend this model and obtain the optimum symmetric probing rate that achieves the maximum network throughput as a function of the average propagation delay, d¯, and the number of nodes sharing the channel, N. The proposed model predicts that the total capacity decreases with d¯−1 as N goes to infinity when all nodes probe the channel at the optimum rate. The optimum probing rate for each node decreases with 1/N and the total optimum probing rate decreases faster than d¯−1 as N goes to infinity. We investigate how the short-term unfairness problem in CSMA worsens as the propagation delay increases and propose a back-off mechanism to mitigate this issue. The theoretical results presented in this paper can be used as a benchmark for the performance improvements provided by algorithms that have already been developed

    Effect of network density and size on the short-term fairness performance of CSMA systems

    Get PDF
    As the penetration of wireless networks increase, number of neighboring networks contending for the limited unlicensed spectrum band increases. This interference between neighboring networks leads to large systems of locally interacting networks. We investigate whether the short-term fairness of this system of networks degrades with the system size and density if transmitters employ random spectrum access with carrier sensing (CSMA). Our results suggest that (a) short-term fair capacity, which is the throughput region that can be achieved within the acceptable limits of short-term fairness, reduces as the number of contending neighboring networks, i.e., degree of the conflict graph, increases for random regular conflict graphs where each vertex has the same number of neighbors, (b) short-term fair capacity weakly depends on the network size for a random regular conflict graph but a stronger dependence is observed for a grid deployment. We demonstrate the implications of this study on a city-wide Wi-Fi network deployment scenario by relating the short-term fairness to the density of deployment. We also present related results from the statistical physics literature on long-range correlations in large systems and point out the relation between these results and short-term fairness of CSMA systems. © 2012 Koseoglu et al; licensee Springer

    From social interactions to private environmental behaviours: The case of consumer food waste

    Get PDF
    Consumer food waste, like many environmental behaviours, takes place in private, and is not directly subject to social monitoring. Nevertheless, social interactions can affect private opinions and behaviours. This paper builds an agent-based model of interactions between consumers heterogeneous in their sociability, their initial opinions and behaviours related to food waste, and their willingness to consider different opinions, in order to assess how social interactions can affect private behaviours. Compared to existing models of opinion dynamics, we innovate by including a range of “cognitive dissonance” between stated opinions and actual behaviours that consumers are willing to accept before changing one of the two. We calibrate the model using questionnaire data on household food waste in Italy. We find that a limited degree of mixing between different socio-demographic groups, namely adult and young consumers, is enough to trigger change, but a certain openness of mind is required from more wasteful individuals. Equally, a small group of environmentally committed consumers can attract a sizeable share of the population towards low-waste behaviours if they show a certain variability of opinions and are willing to compromise with individuals in their close neighbourhood in terms of opinions. These findings can help design effective interventions to promote pro-environmental behaviours, taking advantage of the beneficial network effects while anticipating negative externalities

    Coordinate regulation of histone mRNA metabolism and DNA replication: Cyclin A/cdk1 is involved in inactivation of histone mRNA metabolism and DNA replication at the end of S phase

    Get PDF
    S phase is characterized by the replication of DNA and assembly of chromatin. This requires the synthesis of large amounts of histone proteins to package the newly replicated DNA. Histone mRNAs are the only mRNAs that do not have polyA tails, ending instead in a conserved stemloop sequence. The stemloop binding protein (SLBP) that binds the 3′ end of histone mRNA is cell cycle regulated and SLBP is required in all steps of histone mRNA metabolism. Activation of cyclin E/cdk2 prior to entry into S-phase is critical for initiation of DNA replication and histone mRNA accumulation. At the end of S phase SLBP is rapidly degraded as a result of phosphorylation of SLBP by cyclin A/cdk1 and CK2 effectively shutting off histone mRNA biosynthesis. E2F1, which is required for expression of many S-phase genes, is regulated in parallel with SLBP and its degradation also requires a cyclin binding site, suggesting that it may also be regulated by the same pathway. It is likely that activation of cyclin A/cdk1 helps inhibit both DNA replication and histone mRNA accumulation, marking the end of S phase and entry into G2-phase

    Connectivity analysis of an AUV network with OFDM based communications

    Get PDF
    Autonomous underwater vehicle (AUV) networks play a crucial role in tactical, commercial, and scientific applications, where reliable and robust communication protocols are needed due to the challenging characteristics of the channel. With this motivation, connectivity of AUV networks in different regions with varying transducer characteristics are analyzed through simulations based on real-life orthogonal frequency division multiplexing (OFDM) based communication experiments over noisy and Doppler-distorted channels. Doppler compensation is performed according to the autocorrelation using the cyclic prefix. Using binary and quadrature phase shift keying (BPSK and QPSK) modulation schemes in conjunction with low density parity check (LDPC) coding, error rate levels are investigated through shallow water pond and at-sea experiments. It is shown that, the utilized transmission scheme is capable of correcting all bit errors among nearly one million bits transmitted up to a distance of 1 km, yielding a payload rate of 15.6 kbps with 4096 subcarriers and QPSK modulation. The simulations provide key parameters that must be taken into account in the design of scalable and connected AUV networks. © 2017 IEEE

    Limitations of Dutch Growth Research Foundation Commercial Software Weight Velocity for Age Standard Deviation Score

    Get PDF
    BACKGROUND The commercial software for hospitals, Weight Velocity for Age Standard Deviation Score (SDSWVA), claims to document the growth and development of children, although published details are unavailable. The statistics-derived parameter SDSWVA includes the weight velocity at age t, WV(t) (weight gained between t and (t-1.23) years, divided by 1.23), and 3 standard weight velocity curves at average age AA, defined as AA=t-1.23/2 years. SDSWVA denotes the number of standard deviations that WV(t) deviates from the 0 SD weight velocity at AA. WV(t) yielded erroneous outcomes when applied to weights of a seriously underweight boy with an allergy to cows' milk who showed strong weight growth after being fed on food free of cows' milk. The SDSWVA software tacitly suggests that it is more accurate than WV(t). CASE REPORT The case of this boy was previously described in this Journal. Using SDSWVA(t,AA) software, his weight growth was analyzed by his third pediatrician, beginning at age 1.5 years. The diagnosis of the mother with Pediatric Condition Falsification was confirmed, adding 6 months to foster care, which totalled 8.5 months. Testing of the SDSWVA software on the boy's weight curve yielded results that were complex, nontransparent, and as erroneous as WV(t), explaining the misdiagnosis by the third pediatrician. CONCLUSIONS SDSWVA software should not be used for children under 3 years and during variable weight behavior. Erroneous performance, unpublished details, and an error identified in their new but untested software make the Dutch Growth Research Foundation unlikely to meet the 2020 European Union regulations for in vitro medical devices
    corecore